Computational complexity theory

Results: 2049



#Item
971On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder lo

On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder lo

Add to Reading List

Source URL: tocl.acm.org

Language: English - Date: 2013-09-23 12:22:15
972Reducing Truth-telling Online Mechanisms to Online Optimization Baruch Awerbuch Yossi Azar

Reducing Truth-telling Online Mechanisms to Online Optimization Baruch Awerbuch Yossi Azar

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:16:16
973IS IT REALLY ZERO? CHEE K. YAP Algebra is generous, she often gives more than is asked of her. — Jean Le Rond d’Alembart[removed]The history of the zero recognition problem is somewhat confused by the fact that man

IS IT REALLY ZERO? CHEE K. YAP Algebra is generous, she often gives more than is asked of her. — Jean Le Rond d’Alembart[removed]The history of the zero recognition problem is somewhat confused by the fact that man

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2007-03-05 17:40:23
974CS 155: Homework 1 Douglas Lanman [removed] 14 September[removed]Problem 1

CS 155: Homework 1 Douglas Lanman [removed] 14 September[removed]Problem 1

Add to Reading List

Source URL: mesh.brown.edu

Language: English - Date: 2006-09-14 16:47:07
975Upper and Lower Bounds on the Cost of a Map-Reduce Computation ∗ Foto N. Afrati† , Anish Das Sarma] , Semih Salihoglu‡ , Jeffrey D. Ullman‡ National Technical University of Athens, ] Google Research, ‡ Stanford

Upper and Lower Bounds on the Cost of a Map-Reduce Computation ∗ Foto N. Afrati† , Anish Das Sarma] , Semih Salihoglu‡ , Jeffrey D. Ullman‡ National Technical University of Athens, ] Google Research, ‡ Stanford

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-04-25 03:37:48
976Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed]

Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed]

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:25:17
9771  Complexity of Real Approximation: Brent Revisited Chee Yap Courant Institute of Mathematical Sciences

1 Complexity of Real Approximation: Brent Revisited Chee Yap Courant Institute of Mathematical Sciences

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-02-22 12:21:24
978A Framework for Interactive Proof David Aspinall1 , Christoph L¨ uth2 , and Daniel Winterstein1 1  2

A Framework for Interactive Proof David Aspinall1 , Christoph L¨ uth2 , and Daniel Winterstein1 1 2

Add to Reading List

Source URL: proofgeneral.inf.ed.ac.uk

Language: English - Date: 2007-10-25 09:31:45
979November 5, [removed]:43 WSPC/Trim Size: 9in x 6in for Review Volume

November 5, [removed]:43 WSPC/Trim Size: 9in x 6in for Review Volume

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2008-11-05 16:58:57